On the implementation of a multiple outputs algorithm for defeasible argumentation
نویسندگان
چکیده
In a previous work we defined a recursive warrant semantics for Defeasible Logic Programming based on a general notion of collective conflict among arguments. The main feature of this recursive semantics is that an output of a program is a pair consisting of a set of warranted and a set of blocked formulas. A program may have multiple outputs in case of circular definitions of conflicts among arguments. In this paper we design an algorithm for computing each output and we provide an experimental evaluation of the algorithm based on two SAT encodings defined for the two main combinatorial subproblems that arise when computing warranted and blocked conclusions for each output.
منابع مشابه
RP-DeLP: a weighted defeasible argumentation framework based on a recursive semantics
In this article, we propose a recursive semantics for warranted formulas in a general defeasible logic argumentation framework by formalizing a notion of collective (non-binary) conflict among arguments. The recursive semantics for warranted formulas is based on the intuitive grounds that if an argument is rejected, then further arguments built on top of it should also be rejected. The main cha...
متن کاملMaximal Ideal Recursive Semantics for Defeasible Argumentation
In [1] a recursive warrant semantics for Defeasible Logic Programming extended with levels of possibilistic uncertainty for defeasible rules was introduced. The resulting argumentation framework, called RP-DeLP, is based on a general notion of collective (non-binary) conflict among arguments allowing to ensure direct and indirect consistency properties with respect to the strict knowledge. An o...
متن کاملOn the Implementation of a Multiple Output Algorithm for Defeasible Argumentation
In a previous work we defined a recursive warrant semantics for Defeasible Logic Programming based on a general notion of collective conflict among arguments. The main feature of this recursive semantics is that an output of a program is a pair consisting of a set of warranted and a set of blocked formulas. A program may have multiple outputs in case of circular definitions of conflicts among a...
متن کاملRP-DeLP: A weighted defeasible argumentation framework based on a recursive semantics
In this paper we propose a recursive semantics for warranted formulas in a general defeasible logic argumentation framework by formalizing a notion of collective (nonbinary) conflict among arguments. The recursive semantics for warranted formulas is based on the intuitive grounds that if an argument is rejected, then further arguments built on top of it should also be rejected. The main charact...
متن کاملRP-DeLP: A weighted defeasible argumentation framework based on a recursive semantics
In this paper we propose a recursive semantics for warranted formulas in a general defeasible logic argumentation framework by formalizing a notion of collective (nonbinary) conflict among arguments. The recursive semantics for warranted formulas is based on the intuitive grounds that if an argument is rejected, then further arguments built on top of it should also be rejected. The main charact...
متن کامل